The TV-Break Packing Problem

Improving Global Constraints Support by Local Search

Most global constraints maintain a support for their filtering algorithm, namely a tuple consistent with both the constraint and current domains. However, this highly valuable information is rarely used outside of the constraint. In this paper we define the TV-Break Packing problem (TVBP) and we propose a generic hybridization scheme that we test on this real-world application. The principle of...

Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items

In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...

The complexity of scheduling TV commercials (draft version)

Television commercial scheduling is a generalised form of bin-packing problem, but the bins are rather small, leaving the complexity of the problem unclear. This paper shows that if spot-fixing is allowed, then the problem is NP-complete, even when the breaks are short (polynomially bounded). We also show that scheduling unit-length spots is easy. The paper also aims to provide a fairly simple ...

A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem

In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...

 Abstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...